搜索资源列表
tom_cow
- we use breadth-first algorithm to find a augmenting path The max flow is all the power flow out the source node or sink into the destination node.
MinCutAlgorithm
- 这是自己用c#写的一段关于图的最小切的算法，主要参考了论文： 《An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision》 此文中的算法是目前比较优秀的最小切算法
An_Experimental_Comparison_of_maxflow_aigorithm.ra
- 是基于Graph cuts 的源程序，用来求解Min-Cut/Max-Flow.
max flow/min cut
- max flow/min cut 实现最大流最小割算法的程序
flow
- 即时监控网络流量并统计最大最小流量，并以图表的形式体现出来-Real-time monitoring network traffic and statistics max-min flow rate, and to chart out the form of
max-flow-min-cut-theorem
- 初学最大流最小割的几个很有用的参考资料，详细介绍了它的应用，很有帮助哦！-Maximum flow minimum cut beginner several useful references, details of its application, very helpful Oh!
maxflow-v3.0.src.tar
- 图像处理最大流最小割经典算法,适合初学者使用！-A classic max flow/min cut algorithm in image processing
Ford-Fulkerson
- Ford-Fulkerson Min cut / Max flow-Ford-Fulkerson Min cut/Max flow
max_flow
- 介绍最大流算法的ppt，The Ford-Fulkerson Augmenting Path Algorithm，The Capacity Scaling Algorithm，The Goldberg-Tarjan Preflow Push Algorithm，-Introduction maximum flow algorithm ppt, The Ford-Fulkerson Augmenting Path Algorithm, The Capacity Scaling Algorithm,
newmaxflowaigorithm
- 实现了An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision [Yuri Boykov and Vladimir Kolmogorov]中的新的最大流算法，经过实验验证比传统的最大流算法效率更高-Achieved An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Mini
MAX_flow
- MATLAB 网络最佳流，最大截源码库。-max flow for MATLAB
MaxFlowcpp
- max flow min cut in c++ code
Max-flow
- 用于计算最大流量，可用于陆路交通和河流等交通系统中的流量计算-Used to calculate the maximum flow, can be used for land transport and river transport systems such as the flow calculation
ford-max-flow
- 解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。-Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maxim
max-flow
- 最大网络流模板 EK算法 uva Internet Bandwidth 解答-The maximum network flow algorithm uva Internet Bandwidth template EK answers
max-flow-min-cut
- max-flow/min-cut algo
max-flow
- kolmogorov提出的最大流算法代码，可运行，里面有具体事例-Max flow
Dinic java algorithm
- Dinic java algorithm max flow
Dinic python algorithm
- Dinic python algorithm for max flow
Max-flow
- 在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-There is a detail in the preparation of this function, and when I take a point that has not been checked, I take the closest point. If you add a randomly selected statement, y